Partial Degree Formulae for Plane Offset Curves

In this paper we present several formulae for computing the partial degrees of the defining polynomial of the offset curve to an irreducible affine plane curve given implicitly, and we see how these formulae particularize to the case of rational curves. In addition, we present a formula for computing the degree w.r.t the distance variable.Comment: 24 pages, no figure

Rational parametrization of conchoids to algebraic curves

We study the rationality of each of the components of the conchoid to an irreducible algebraic affine plane curve, excluding the trivial cases of the lines through the focus and the circle centered at the focus and radius the distance involved in the conchoid. We prove that conchoids having all their components rational can only be generated by rational curves. Moreover, we show that reducible conchoids to rational curves have always their two components rational. In addition, we prove that the rationality of the conchoid component, to a rational curve, does depend on the base curve and on the focus but not on the distance. As a consequence, we provide an algorithm that analyzes the rationality of all the components of the conchoid and, in the affirmative case, parametrizes them. The algorithm only uses a proper parametrization of the base curve and the focus and, hence, does not require the previous computation of the conchoid. As a corollary, we show that the conchoid to the irreducible conics, with conchoid-focus on the conic, are rational and we give parametrizations. In particular we parametrize the Limaçons of Pascal. We also parametrize the conchoids of Nicomedes. Finally, we show how to find the foci from where the conchoid is rational or with two rational components

Rational conchoid and offset constructions: algorithms and implementation

This paper is framed within the problem of analyzing the rationality of the components of two classical geometric constructions, namely the offset and the conchoid to an algebraic plane curve and, in the affirmative case, the actual computation of parametrizations. We recall some of the basic definitions and main properties on offsets (see [13]), and conchoids (see [15]) as well as the algorithms for parametrizing their rational components (see [1] and [16], respectively). Moreover, we implement the basic ideas creating two packages in the computer algebra system Maple to analyze the rationality of conchoids and offset curves, as well as the corresponding help pages. In addition, we present a brief atlas where the offset and conchoids of several algebraic plane curves are obtained, their rationality analyzed, and parametrizations are provided using the created packages

A really elementary proof of real Lüroth theorem

Sin resume

An Algebraic Analysis of Conchoids to Algebraic Curves

We study the conchoid to an algebraic affine plane curve C from the perspective of algebraic geometry, analyzing their main algebraic properties. Beside C, the notion of conchoid involves a point A in the affine plane (the focus) and a nonzero field element d (the distance).We introduce the formal definition of conchoid by means of incidence diagrams.We prove that the conchoid is a 1-dimensional algebraic set having atmost two irreducible components. Moreover, with the exception of circles centered at the focus A and taking d as its radius, all components of the corresponding conchoid have dimension 1. In addition, we introduce the notions of special and simple components of a conchoid. Furthermore we state that, with the exception of lines passing through A, the conchoid always has at least one simple component and that, for almost every distance, all the components of the conchoid are simple. We state that, in the reducible case, simple conchoid components are birationally equivalent to C, and we show how special components can be used to decide whether a given algebraic curve is the conchoid of another curve

Conchoidal transform of two plane curves

The conchoid of a plane curve $C$ is constructed using a fixed circle $B$ in the affine plane. We generalize the classical definition so that we obtain a conchoid from any pair of curves $B$ and $C$ in the projective plane. We present two definitions, one purely algebraic through resultants and a more geometric one using an incidence correspondence in \PP^2 \times \PP^2. We prove, among other things, that the conchoid of a generic curve of fixed degree is irreducible, we determine its singularities and give a formula for its degree and genus. In the final section we return to the classical case: for any given curve $C$ we give a criterion for its conchoid to be irreducible and we give a procedure to determine when a curve is the conchoid of another.Comment: 18 pages Revised version: slight title change, improved exposition, fixed proof of Theorem 5.3 Accepted for publication in Appl. Algebra Eng., Commun. Comput

Encoding points on hyperelliptic curves over finite fields in deterministic polynomial time

We present families of (hyper)elliptic curve which admit an efficient deterministic encoding function

On Symbolic Solutions of Algebraic Partial Differential Equations

The final version of this paper appears in Grasegger G., Lastra A., Sendra J.R. and\ud Winkler F. (2014). On symbolic solutions of algebraic partial differential equations, Proc.\ud CASC 2014 SpringerVerlag LNCS 8660 pp. 111-120. DOI 10.1007/978-3-319-10515-4_9\ud and it is available at at Springer via http://DOI 10.1007/978-3-319-10515-4_9In this paper we present a general procedure for solving rst-order autonomous\ud algebraic partial di erential equations in two independent variables.\ud The method uses proper rational parametrizations of algebraic surfaces\ud and generalizes a similar procedure for rst-order autonomous ordinary\ud di erential equations. We will demonstrate in examples that, depending on\ud certain steps in the procedure, rational, radical or even non-algebraic solutions\ud can be found. Solutions computed by the procedure will depend on\ud two arbitrary independent constants

Prediction of Pathological Tremor Signals Using Long Short-Term Memory Neural Networks

Previous implementations of closed-loop peripheral electrical stimulation (PES) strategies have provided evidence about the effect of the stimulation timing on tremor reduction. However, these strategies have used traditional signal processing techniques that only consider phase prediction and might not model the non-stationary behavior of tremor. Here, we tested the use of long short-term memory (LSTM) neural networks to predict tremor signals using kinematic data recorded from Essential Tremor (ET) patients. A dataset comprising wrist flexion-extension data from 12 ET patients was pre-processed to feed the predictors. A total of 180 models resulting from the combination of network (neurons and layers of the LSTM networks, length of the input sequence and prediction horizon) and training parameters (learning rate) were trained, validated and tested. Predicted tremor signals using LSTM-based models presented high correlation values (from 0.709 to 0.998) with the expected values, with a phase delay between the predicted and real signals below 15 ms, which corresponds approximately to 7.5% of a tremor cycle. The prediction horizon was the parameter with a higher impact on the prediction performance. The proposed LSTM-based models were capable of predicting both phase and amplitude of tremor signals outperforming results from previous studies (32 - 56% decreased phase prediction error compared to the out-of-phase method), which might provide a more robust PES-based closed-loop control applied to PES-based tremor reduction.The authors would like to thank Cristina Montero Pardo for illustrations from Fig. 1 and the patients from Gregorio Marañón Hospital who voluntarily participated in this study